LMDS-based approach for efficient top-k local ligand-binding site search

نویسندگان

  • Sungchul Kim
  • Lee Sael
  • Hwanjo Yu
چکیده

In this work, we propose a LMDS-based binding-site search for improving the search speed of the Patch-Surfer method. Patch-Surfer is efficient in recognition of protein-ligand binding partners, further speedup is necessary to address multiple-user access. Futher speedup is realised by exploiting Landmark Multi-Dimensional Scaling (LMDS). It computes embedding coordinates for data points based on their distances from landmark points. When selecting the landmark points, we adopt two approaches--random and greedy selection. Our method approximately retrieves top-k results and the accuracy increases as we exploit more landmark points. Although two landmark selection approaches show comparable results, the greedy selection shows the best performance when the number of landmark points is large. Using our method, the searching time is reduced up to 99% and it retrieves almost 80% of exact top-k results. Additionally, LMDS-based binding-site search+ improves the retrieval accuracy from 80% to 95% while sacrificing the speedup ratio from 99% to 90% compared to Patch-Surfer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ligand-based pharmacophore modeling to identify plant-derived acetylcholinesterase inhibitor natural compounds in Alzheimer’s disease

Background: Alzheimer’s disease (AD) is a neurodegenerative disease characterized by decreased cognitive function in patients due to forming Aβ peptides and neurofibrillary tangles (NFT) in the brain. Therefore, the need to develop new treatments can reduce this risk. Acetylcholinesterase is one of the targets used in the design of new drugs for the treatment of AD. The researchers obtain new i...

متن کامل

Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

متن کامل

Fragment-based Binding Efficiency Indices in Bioactive Molecular Design: A Computational Approach to BACE-1 Inhibitors

One of the most important targets in Alzheimer disease is Beta site amyloid precursor protein cleaving enzyme-1 (BACE-1). It is a membrane associated protein and is one of the main enzymes responsible for amyloid β (Aβ) production. Up to now, a considerable number of peptidic and non-peptidic inhibitors of BACE-1 have been developed. Recently, small molecule BACE-1 inhibitors have attracted the...

متن کامل

Fragment-based Binding Efficiency Indices in Bioactive Molecular Design: A Computational Approach to BACE-1 Inhibitors

One of the most important targets in Alzheimer disease is Beta site amyloid precursor protein cleaving enzyme-1 (BACE-1). It is a membrane associated protein and is one of the main enzymes responsible for amyloid β (Aβ) production. Up to now, a considerable number of peptidic and non-peptidic inhibitors of BACE-1 have been developed. Recently, small molecule BACE-1 inhibitors have attracted the...

متن کامل

The utility of geometrical and chemical restraint information extracted from predicted ligand-binding sites in protein structure refinement.

Exhaustive exploration of molecular interactions at the level of complete proteomes requires efficient and reliable computational approaches to protein function inference. Ligand docking and ranking techniques show considerable promise in their ability to quantify the interactions between proteins and small molecules. Despite the advances in the development of docking approaches and scoring fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • International journal of data mining and bioinformatics

دوره 12 4  شماره 

صفحات  -

تاریخ انتشار 2015